Sets with many pairs of orthogonal vectors over finite fields

نویسندگان

  • Omran Ahmadi
  • Ali Mohammadian
چکیده

Let n be a positive integer and B be a non-degenerate symmetric bilinear form over Fq , where q is an odd prime power and Fq is the finite field with q elements. We determine the largest possible size of a subset S of Fq such that |{B(x,y) |x,y ∈ S and x 6= y}| = 1. We also pose some conjectures concerning nearly orthogonal subsets of Fq where a nearly orthogonal subset T of Fq is a set of vectors in which among any three distinct vectors there are two vectors x,y so that B(x,y) = 0.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Orthogonal Systems in Vector Spaces over Finite Fields

We prove that if a subset of the d-dimensional vector space over a finite field is large enough, then it contains many k-tuples of mutually orthogonal vectors.

متن کامل

On the Number of Orthogonal Systems in Vector Spaces over Finite Fields

Iosevich and Senger (2008) showed that if a subset of the d-dimensional vector space over a finite field is large enough, then it contains many k-tuples of mutually orthogonal vectors. In this note, we provide a graph theoretic proof of this result.

متن کامل

Finding orthogonal vectors in discrete structures

Hopcroft’s problem in d dimensions asks: given n points and n hyperplanes in R, does any point lie on any hyperplane? Equivalently, if we are given two sets of n vectors each in R, is there a pair of vectors (one from each set) that are orthogonal? This problem has a long history and a multitude of applications. It is widely believed that for large d, the problem is subject to the curse of dime...

متن کامل

Additive Energy and the Falconer Distance Problem in Finite Fields

We study the number of the vectors determined by two sets in d-dimensional vector spaces over finite fields. We observe that the lower bound of cardinality for the set of vectors can be given in view of an additive energy or the decay of the Fourier transform on given sets. As an application of our observation, we find sufficient conditions on sets where the Falconer distance conjecture for fin...

متن کامل

Information sets and partial permutation decoding for codes from finite geometries

We determine information sets for the generalized Reed-Muller codes and use these to apply partial permutation decoding to codes from finite geometries over prime fields. We also obtain new bases of minimum-weight vectors for the codes of the designs of points and hyperplanes over prime fields.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Finite Fields and Their Applications

دوره 37  شماره 

صفحات  -

تاریخ انتشار 2016